Limit cycles and update digraphs in Boolean networks
نویسندگان
چکیده
منابع مشابه
0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کامل0n removable cycles in graphs and digraphs
in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...
متن کاملOn the preservation of limit cycles in Boolean networks under different updating schemes
Boolean networks under different deterministic updating schemes are analyzed. It is direct to show that fixed points are invariant against changes in the updating scheme, nevertheless, it is still an open problem to fully understand what happens to the limit cycles. In this paper, a theorem is presented which gives a sufficient condition for a Boolean network not to share the same limit cycle u...
متن کاملCycles in dense digraphs
Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let β(G) denote the size of the smallest subset X ⊆ E(G) such that G \ X has no directed cycles, and let γ(G) be the number of unordered pairs {u, v} of vertices such that u, v are nonadjacent in G. It is easy to see that if γ(G) = 0 then β(G) = 0; what can we say about β(G) if γ(G) is bounded? ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.07.003